Search results for "Formal grammar"

showing 5 items of 5 documents

Five Ways in Which Computational Modeling Can Help Advance Cognitive Science

2019

Abstract There is a rich tradition of building computational models in cognitive science, but modeling, theoretical, and experimental research are not as tightly integrated as they could be. In this paper, we show that computational techniques—even simple ones that are straightforward to use—can greatly facilitate designing, implementing, and analyzing experiments, and generally help lift research to a new level. We focus on the domain of artificial grammar learning, and we give five concrete examples in this domain for (a) formalizing and clarifying theories, (b) generating stimuli, (c) visualization, (d) model selection, and (e) exploring the hypothesis space.

Linguistics and LanguageArtificial grammar learningComputer scienceCognitive Neuroscience[SHS.PSY]Humanities and Social Sciences/PsychologyExperimental and Cognitive PsychologyBayesian inferenceArtificial grammar learningArticle050105 experimental psychology03 medical and health sciences0302 clinical medicineArtificial IntelligenceHumans0501 psychology and cognitive sciencesCognitive scienceComputational modelPsycholinguisticsArtificial neural networkLift (data mining)Model selection05 social sciencesComputational modelingModels TheoreticalArtificial language learningFormal grammarsExperimental researchBayesian modelingVisualizationHuman-Computer InteractionCognitive ScienceNeural Networks ComputerForthcoming Topic: Learning Grammatical Structures: Developmental Cross‐species and Computational Approaches030217 neurology & neurosurgeryNeural networksTopics in Cognitive Science
researchProduct

A syntax controlled generator of formal language processors

1963

Formal grammarUniversal Networking LanguageGeneral Computer ScienceComputer scienceProgramming languageObject languageFormal specificationProgramming language specificationSpecification languageSyntax errorcomputer.software_genrecomputerContext-sensitive languageCommunications of the ACM
researchProduct

Cancellation, pumping and permutation in formal languages

1984

Formal grammarTheoretical computer scienceChomsky hierarchyFormal languageContext-free languageAbstract family of languagesPumping lemma for context-free languagesArithmeticCone (formal languages)Pumping lemma for regular languagesMathematics
researchProduct

Two-dimensional filters for structured text

1997

The paper introduces a method for defining filters for structured text. In the method, the text structure is originally defined by a grammar consisting of a set of productions. To describe the information interests, a two-dimensional template is first created interactively from the grammar to show the structure of a set of textual elements, at a chosen level of detail. The template depicts the hierarchical structure of the elements and indicates also optionality, alternatives, and iteration in the structure. Then, the template is filled by constraints and annotations. The constraints allow giving conditions to the content of parts, to the position of parts in an ordered set of parts, and to…

Structure (mathematical logic)Document Structure DescriptionTheoretical computer scienceProperty (programming)Computer sciencebusiness.industryLevel of detail (writing)Library and Information SciencesManagement Science and Operations ResearchComputer Science ApplicationsSet (abstract data type)Formal grammarStructured textMedia TechnologybusinessInformation SystemsGraphical user interfaceInformation Processing & Management
researchProduct

Extending formal language hierarchies to higher dimensions

1999

General Computer ScienceProgramming languageComputer scienceObject languagecomputer.software_genreFormal systemTheoretical Computer ScienceFormal grammarDeterministic finite automatonRegular languageFormal languageAutomata theoryNondeterministic finite automatoncomputerACM Computing Surveys
researchProduct